Computational Complexity and Feasibility of Fuzzy
نویسندگان
چکیده
In many real-life situations, we cannot directly measure or estimate the desired quantity r. In these situations, we measure or estimate other quantities r 1 ; : : :; r n related to r, and then reconstruct r from the estimates for r i. This reconstruction is called data processing. Often, we only have fuzzy information about r i. In such cases, we have fuzzy data processing. Fuzzy data means that instead of a single number r i , we have several numbers that describes the fuzzy knowledge about the corresponding quantity. Since we need to process more numbers, the computation time for fuzzy data processing is often much larger than for the usual non-fuzzy one. It is, therefore , desirable to select representations and processing algorithms that minimize this increase and thus, make fuzzy data processing feasible. In this paper, we show that the necessity to minimize computation time explains why we use fuzzy numbers, and describes what operations we should use. In many real-life situations, we cannot directly measure or estimate the desired quantity r. For example, we cannot directly measure the distance to a star or the amount of oil in a well. In these situations, we measure or estimate other quantities r 1 ; : : :; r n related to r, and then reconstruct r from the estimates for r i. This reconstruction is called data processing. In many real-life applications, we have to deal with quantities r i whose values we do not know precisely, and instead, we only have expert (fuzzy) knowledge about these values. This knowledge is usually described in terms of membership functions i (x) that assign to every real number x the expert's degree of belief i (x) 2 0; 1] that the actual (unknown) value of the quantity r i is equal to x. We want to use the expert (fuzzy) knowledge about the values r 1 ; : : :; r n of some quantities to predict the value of some quantity r that is related to r i. In this paper, we will consider the simplest case when \re-lated" means that we know the exact form of the dependency r = f(r 1 ; : : :; r n) between r i and r, and the only uncertainty in r is caused by the uncertainty in the values of r i. In such situations, we must transform …
منابع مشابه
Classification of Streaming Fuzzy DEA Using Self-Organizing Map
The classification of fuzzy data is considered as the most challenging areas of data analysis and the complexity of the procedures has been obstacle to the development of new methods for fuzzy data analysis. However, there are significant advances in modeling systems in which fuzzy data are available in the field of mathematical programming. In order to exploit the results of the researches on ...
متن کاملA new quadratic deviation of fuzzy random variable and its application to portfolio optimization
The aim of this paper is to propose a convex risk measure in the framework of fuzzy random theory and verify its advantage over the conventional variance approach. For this purpose, this paper defines the quadratic deviation (QD) of fuzzy random variable as the mathematical expectation of QDs of fuzzy variables. As a result, the new risk criterion essentially describes the variation of a fuzzy ...
متن کاملElectricity Load Forecasting by Combining Adaptive Neuro-fuzzy Inference System and Seasonal Auto-Regressive Integrated Moving Average
Nowadays, electricity load forecasting, as one of the most important areas, plays a crucial role in the economic process. What separates electricity from other commodities is the impossibility of storing it on a large scale and cost-effective construction of new power generation and distribution plants. Also, the existence of seasonality, nonlinear complexity, and ambiguity pattern in electrici...
متن کاملBilateral Weighted Fuzzy C-Means Clustering
Nowadays, the Fuzzy C-Means method has become one of the most popular clustering methods based on minimization of a criterion function. However, the performance of this clustering algorithm may be significantly degraded in the presence of noise. This paper presents a robust clustering algorithm called Bilateral Weighted Fuzzy CMeans (BWFCM). We used a new objective function that uses some k...
متن کاملFeasibility as a gradual notion
The notion of feasibility, applicable in various areas related to logic, is arguably of gradual nature—some tasks are more feasible than others. The possibility of modeling a gradual notion of feasibility in t-norm logics is brought forward and illustrated on the gradual notions of feasible number, feasible knowledge, feasible formula, and feasible computability.
متن کاملA comparative performance of gray level image thresholding using normalized graph cut based standard S membership function
In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...
متن کامل